Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
نویسندگان
چکیده
منابع مشابه
Sequence Alignment Algorithms for Run-Length-Encoded Strings
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn′,m′n}) time and O(max{m,n}) space, for two strings of lengths m and n, with m′ and n′ runs, respectively. We assume the linear-gap model and make no assumption on the scoring matrices, which maximizes the applicability of these algorithms. The trac...
متن کاملMatching for Run-Length Encoded Strings
1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...
متن کاملEdit distance of run-length encoded strings
Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l+|Y |k) time algorithm that computes their edit distance. 2002 Elsevier Science B.V. All rights reserved.
متن کاملAlternative Algorithms for Lyndon Factorization
We present two variations of Duval’s algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval’s original algorithm, more than ten...
متن کاملFast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings
In the constrained longest common subsequence (CLCS) problem, we are given two sequences X , Y and the constrained sequence P in run-length encoded (RLE) format, where |X| = n, |Y | = m and |P | = r and the numbers of runs in RLE format are N , M and R, respectively. In this paper, we show that after the sequences are encoded, the CLCS problem can be solved in O(NMr+ r × min{q1, q2} + q3) time,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12060124